Agreeing to Agree: Reaching Unanimity via Preference Dynamics Based on Reliable Agents
نویسندگان
چکیده
Situations akin to public deliberation leading to preference changes are modelled. A set of agents is considered, each endowed with a preference relation over a set of objects and a reliability relation over the involved agents. Different ways in which the public announcement of the current individual preferences can influence the agents’ future preferences are studied. Special emphasis is given to ways in which the repetitive public announcement of the individual preferences lead to a unanimity on preferences.
منابع مشابه
Solidarity and Unanimity in Attribute-Based Domains
We study the implications of population-monotonicity (Thomson, 1983) and replacement-domination (Moulin, 1987) in the class of attributebased preference domains (Nehring and Puppe 2002 a,b). Both conditions require that when some parameters of the economy change, the agents whose parameters are kept xed, should either all weakly lose or all weakly win. Population-monotonicity applies to the ar...
متن کاملUnanimity in Attributebased Preference Domains Unanimity in Attribute-based Preference Domains
We provide several characterizations of unanimity decision rules, in a public choice model where preferences are constrained by attributes possessed by the alternatives (Nehring and Puppe, 2007a,b). Solidarity conditions require that when some parameters of the economy change, the agents whose parameters are kept fixed either all weakly lose or they all weakly win. Population-monotonicity (Thom...
متن کاملAgreeing to agree and Dutch books
We say that agreeing to agree is possible for an event E if there exist posterior beliefs of the agents with a common prior such that it is common knowledge that the agents’ posteriors for E coincide. We propose a notion called Dutch book which is a profile of interim contracts between an outsider and the agents based on the occurrence of E, such that the outsider makes positive profit in all s...
متن کاملThree's company when seeking unanimity.
R andom searches are routinely used in many algorithms, for instance, when looking for the shortest path connecting 100 cities or for ordering genomes in a most-parsimonious descendency tree. In this issue of PNAS, Matsen and Nowak (1) use a random search for another type of problem, that of finding coherence rather than optimality. The task thus consists of reaching unanimity. The proposed sol...
متن کاملAgreeing to Disagree with Limit Knowledge
The possibility for agents to agree to disagree is considered in an extended epistemic-topological framework. In such an enriched context, Aumann’s impossibility theorem is shown to no longer hold. More precisely, agents with a common prior belief satisfying limit knowledge instead of common knowledge of their posterior beliefs may actually entertain distinct posterior beliefs. Hence, agents ca...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015